On the distance spectrum of distance regular graphs
نویسندگان
چکیده
منابع مشابه
Edge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملOn almost distance-regular graphs
Distance-regular graphs have been a key concept in Algebraic Combinatorics and have given place to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we study ‘almost distance-regular graphs’. We use this name informally for graphs that share some regularity properties that are related to distance in the ...
متن کاملRemarks on Distance-Balanced Graphs
Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.
متن کاملShilla distance-regular graphs
A Shilla distance-regular graph Γ (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph Γ, and for Γ we define b = b(Γ) := k a3 . In this paper we will show that there are finitely many Shilla distance-regular graphs Γ with fixed b(Γ) ≥ 2. Also, we will classify Sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2015
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.04.002